منابع مشابه
Contributing vertices-based Minkowski sum computation of convex polyhedra
Minkowski sum is an important operation. It is used in many domains such as: computer-aided design, robotics, spatial planning, mathematical morphology, and image processing. We propose a novel algorithm, named the Contributing Verticesbased Minkowski Sum (CVMS) algorithm for the computation of the Minkowski sum of convex polyhedra. The CVMS algorithm allows to easily obtain all the facets of t...
متن کاملAngular Momentum, Convex Polyhedra and Algebraic Geometry
The three families of classical groups of linear transformations (complex, orthogonal, symplectic) give rise to the three great branches of differential geometry (complex analytic, Riemannian and symplectic). Complex analytic geometry derives most of its interest from complex algebraic geometry, while symplectic geometry provides the general framework for Hamiltonian mechanics. These three clas...
متن کاملAs many antipodes as vertices on some convex polyhedra
An earlier result states that a point of the surface of a convex polyhedron with n vertices, endowed with its intrinsic metric, cannot have more than n antipodes (farthest points). In this paper we produce examples of polyhedra with n vertices, on which some suitable point admits exactly n antipodes. MSC (2000): 52B10, 53C45.
متن کاملAs many antipodes as vertices on convex polyhedra
An earlier result states that, on the surface of a convex polyhedron with vertices endowed with its intrinsic metric, a point cannot have more than antipodes (farthest points). In this paper we produce examples of polyhedra with vertices, on which some suitable point admits exactly antipodes. We also proved that, for any positive number 1, there exist (in the closure of the set of these polyhed...
متن کاملComputing Covering Polyhedra of Non-Convex Objects
We present an algorithm to build covering polyhedra for digital 3D objects, by iteratively filling local concavities. The resulting covering polyhedron is convex and is a good approximation of the convex hull of the object. The algorithm uses 3 x 3 x 3 operators and requires a few minutes for a 128 x 128 x 128 image, when implemented on a sequential computer. Once the covering polyhedron has be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2017
ISSN: 0001-8708
DOI: 10.1016/j.aim.2016.12.026